Computing Approximate Radicals using Bezoutians

نویسندگان

  • Itnuit Janovitz-Freireich
  • Bernard Mourrain
  • Lajos Rónyai
  • Ágnes Szántó
چکیده

Consider I ⊂ C[x1, . . . , xm], a zero dimensional complete intersection ideal, with I = (f1, . . . , fm). Assume that I has clusters of roots, each cluster of radius at most ε in the ∞-norm. We compute the “approximate radical” of I, i.e. an ideal which contains one root for each cluster, corresponding to the center of gravity of the points in the cluster, up to an error term asymptotically bounded by ε. The main bottleneck of our method is the computation of the “matrix of traces”, a matrix with entries which are trace functions of the roots of I with respect to some basis of C[x1, . . . , xm]/I. We investigate how to compute a matrix of traces from the Bezoutian of f1, . . . , fm and their Jacobian J . We use work by Mourrain and Pan to reduce the Bezout matrix to a matrix of traces with respect to a certain canonical basis of C[x1, . . . , xm]/I.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Imprecise Minority-Based Full Adder for ‎Approximate Computing Using CNFETs

   Nowadays, the portable multimedia electronic devices, which employ signal-processing modules, require power aware structures more than ever. For the applications associating with human senses, approximate arithmetic circuits can be considered to improve performance and power efficiency. On the other hand, scaling has led to some limitations in performance of nanoscale circuits. According...

متن کامل

More on polynomial Bezoutians with respect to a general basis

We use unified algebraic methods to investigate the properties of polynomial Bezoutians with respect to a general basis. Not only can three known results be easily verified, but also some new properties of polynomial Bezoutians are obtained. Nonsymmetric Lyapunov-type equations of polynomial Bezoutians are also discussed. It turns out that most properties of classical Bezoutians can be analogou...

متن کامل

Ela More on Polynomial Bezoutians with Respect to a General Basis

We use unified algebraic methods to investigate the properties of polynomial Bezoutians with respect to a general basis. Not only can three known results be easily verified, but also some new properties of polynomial Bezoutians are obtained. Nonsymmetric Lyapunov-type equations of polynomial Bezoutians are also discussed. It turns out that most properties of classical Bezoutians can be analogou...

متن کامل

Approximate Solution of Fuzzy Fractional Differential Equations

‎In this paper we propose a method for computing approximations of solution of fuzzy fractional differential equations using fuzzy variational iteration method. Defining a fuzzy fractional derivative, we verify the utility of the method through two illustrative ‎examples.‎

متن کامل

Fast Fraction-free Triangularization of Bezoutians with Applications to Sub-resultant Chain Computation

An algorithm for the computation of the LU factorization over the integers of an n n Bezoutian B is presented. The algorithm requires O(n 2) arithmetic operations and involves integers having at most O(n log nc) bits, where c is an upper bound of the moduli of the integer entries of B. As an application, by using the correlations between Bezoutians and the Euclidean scheme, we devise a new divi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007